One Dimensional Asynchronous Cooperative Parrondo’s Games

نویسندگان

  • Zoran Mihailović
  • Milan Rajković
چکیده

An analytical result and an algorithm are derived for the probability distribution of the one-dimensional cooperative Parrondo’s games. We show that winning and the occurrence of the paradox depends on the number of players. Analytical results are compared to the results of the computer simulation and to the results based on the mean-field approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Parrondo’s Games on a Two-dimensional Lattice

Cooperative Parrondo’s games on a regular two dimensional lattice are analyzed based on the computer simulations and on the discrete-time Markov chain model with exact transition probabilities. The paradox appears in the vicinity of the probabilites characterisitic of the ”voter model”, suggesting practical applications. As in the one-dimensional case, winning and the occurrence of the paradox ...

متن کامل

Second Parrondo's Paradox in Scale Free Networks

Parrondo’s paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo’s games apparently with the same paradoxical property have been introduced [5]; history dependence, one dimensional line, two dimensional...

متن کامل

The Physical Basis for Parrondo’s Games

Several authors [1–4] have implied that the original inspiration for Parrondo’s games was a physical system called a “flashing Brownian ratchet [5, 6]” The relationship seems to be intuitively clear but, surprisingly, has not yet been established with rigor. The dynamics of a flashing Brownian ratchet can be described using a partial differential equation called the Fokker-Planck equation [7], ...

متن کامل

Quantum Parrondo’s Games

Parrondo’s Paradox arises when two losing games are combined to produce a winning one. A history dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by general SU(2) operators to transform the game into the quantum domain. In the initial state a superposition of qubits can be used to couple the games and produce...

متن کامل

State-Space Visualisation and Fractal Properties of Parrondo’s Games

Parrondo’s games are essentially Markov games. They belong to the same class as Snakes and Ladders. The important distinguishing feature of Parrondo’s games is that the transition probabilities may vary in time. It is as though “snakes,” “ladders” and “dice” were being added and removed while the game was still in progress. Parrondo’s games are not homogeneous in time and do not necessarily set...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003